A Dynamic Heuristic for the Stochastic Unrelated Parallel Machine Scheduling Problem

This paper addresses the problem of batch scheduling in an unrelated parallel machine environment with sequence dependent setup times and an objective of minimizing the total weighted mean completion time. The jobs\u27 processing times and setup times are stochastic for better depiction of the real world. This is a NP-hard problem and in this paper, new heuristics are developed and compared to existing ones using simulation. The results and analysis obtained from the computational experiments proved the superiority of the proposed algorithm PMWP over the other algorithms presented

Development of a System of Systems Engineering Method

Systems engineers have been facing challenges with the design and analysis of multiple complex systems. System of Systems Engineering has emerged to assist in this challenge with the systemic analysis, design, and transformation of complex metasystems. This paper outlines a proposed method to overcome these challenges, which is grounded in System of Systems Engineering principles and methodology. An overview of System of Systems Engineering will be provided for understanding of its significance and the attempt to complement Systems Engineering efforts in dealing with the aforementioned challenges. Finally, discussion on the proposed method, with respect to complex system analysis, is provided